Finitely star regular domains
نویسندگان
چکیده
Let R be an integral domain, Star(R) the set of all star operations on and StarFC(R) finite type R. Then is said to regular if |Star(T)|≤|Star(R)| for every overring T In this paper we introduce notion finitely domain as such that |StarFC(T)|≤|StarFC(R)| each First, show notions domains are completely different do not imply other. Next, extend/generalize well-known results regularity in Noetherian Prüfer contexts regularity. Also handle issued from classical pullback constructions construct regular.
منابع مشابه
Regular Star Complements in Strongly Regular Graphs
We prove that, aside from the complete multipartite graphs and graphs of Steiner type, there are only finitely many connected strongly regular graphs with a regular star complement of prescribed degree s ∈ IN . We investigate the possible parameters when s ≤ 5. AMS Classification: 05C50
متن کاملTiling with Regular Star Polygons
The Archimedean tilings (Figure 1) and polyhedra will be familiar to many readers. They have the property that the tiles of the tiling, or the faces of the polyhedron, are regular polygons, and that the vertices form a single orbit under the symmetries of the tiling or polyhedron. (Grünbaum and Shephard [1] use Archimedean, in relation to tilings, to refer to the sequence of polygons at each ve...
متن کاملDomains Based on Regular Types ?
Domains Based on Regular Types ? John P. Gallagher and Kim S. Henriksen Computer Science, Building 42.1, P.O. Box 260, Roskilde University, DK-4000 Denmark Email: {jpg,kimsh}@ruc.dk Abstract. We show how to transform a set of regular type definitions into a finite pre-interpretation for a logic program. The derived preinterpretation forms the basis for an abstract interpretation. The core of th...
متن کاملOn Message Sequence Graphs and Finitely Generated Regular MSC Languages
Message Sequence Charts (MSCs) are an attractive visual formalism widely used to capture system requirements during the early design stages in domains such as telecommunication software. A standard method to describe multiple communication scenarios is to use message sequence graphs (MSGs). A message sequence graph allows the protocol designer to write a finite specification which combines MSCs...
متن کاملRegular Generalized Star Star closed sets in Bitopological Spaces
The aim of this paper is to introduce the concepts of τ1τ2-regular generalized star star closed sets , τ1τ2-regular generalized star star open sets and study their basic properties in bitopological spaces. Keywords—τ1τ2-regular closed sets; τ1τ2-regular open sets; τ1τ2-regular generalized closed sets; τ1τ2-regular generalized star closed sets; τ1τ2-regular generalized star star closed sets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2022
ISSN: ['1873-1376', '0022-4049']
DOI: https://doi.org/10.1016/j.jpaa.2021.106983